Data capture and identification system and process

ABSTRACT

An identification method and process for objects from digitally captured images thereof that uses data characteristics to identify an object from a plurality of objects in a database. The data is broken down into parameters such as a Shape Comparison, Grayscale Comparison, Wavelet Comparison, and Color Cube Comparison with object data in one or more databases to identify the actual object of a digital image.

This application is a divisional of application Ser. No. 13/968,666,filed Aug. 16, 2013, which is a divisional of Ser. No. 13/633,533, filedOct. 2, 2012 and issued Nov. 12, 2013 as U.S. Pat. No. 8,582,817, whichis a divisional of Ser. No. 13/464,410, filed May 4, 2012 and issuedJul. 23, 2013 as U.S. Pat. No. 8,494,264, which is a divisional of Ser.No. 13/005,716, filed Jan. 13, 2011 and issued Jul. 17, 2012 as U.S.Pat. No. 8,224,077, which is a Continuation of Ser. No. 12/505,714 filedJul. 20, 2009 and issued Feb. 1, 2011 as U.S. Pat. No. 7,881,529, whichis a Continuation of Ser. No. 11/342,094 filed Jan. 26, 2006 and issuedJul. 21, 2009 as U.S. Pat. No. 7,565,008, which is aContinuation-In-Part of Ser. No. 09/992,942, filed Nov. 5, 2001 andissued Mar. 21, 2006 as U.S. Pat. No. 7,016,532, which claims thebenefit of priority to U.S. Provisional Application No. 60/317,521 filedSep. 5, 2001, and U.S. Provisional Application No. 60/246,295 filed Nov.6, 2000. These and all other extrinsic references are incorporatedherein by reference in their entirety. Where a definition or use of aterm in an incorporated reference is inconsistent or contrary to thedefinition of that term provided herein, the definition of that termprovided herein applies and the definition of that term in the referencedoes not apply.

FIELD OF THE INVENTION

The invention relates an identification method and process for objectsfrom digitally captured images thereof that uses data characteristics toidentify an object from a plurality of objects in a database.

BACKGROUND OF THE INVENTION

There is a need to identify an object that has been digitally capturedfrom a database of images without requiring modification or disfiguringof the object. Examples include:

identifying pictures or other art in a large museum, where it is desiredto provide additional information about objects in the museum by meansof a mobile display so that the museum may display objects of interestin the museum and ensure that displays are not hidden or crowded out bysigns or computer screens;

establishing a communications link with a machine by merely taking avisual data of the machine; and

calculating the position and orientation of an object based on theappearance of the object in a data despite shadows, reflections, partialobscuration, and variations in viewing geometry, or other obstructionsto obtaining a complete image. Data capture hardware such as a portabletelephones with digital cameras included are now coming on the marketand it is desirable that they be useful for duties other than picturetaking for transmission to a remote location. It is also desirable thatany identification system uses available computing power efficiently sothat the computing required for such identification can be performedlocally, shared with an Internet connected computer or performedremotely, depending on the database size and the available computingpower. In addition, it is desirable that any such identification systemcan use existing identification markings such as barcodes, specialtargets, or written language when such is available to speed up searchesand data information retrieval.

SUMMARY OF THE INVENTION

The present invention solves the above stated needs. Once a data iscaptured digitally, a search of the data determines whether symboliccontent is included in the image. If so the symbol is decoded andcommunication is opened with the proper database, usually using theInternet, wherein the best match for the symbol is returned. In someinstances, a symbol may be detected, but non-ambiguous identification isnot possible. In that case and when a symbolic data can not be detected,the data is decomposed through identification algorithms where uniquecharacteristics of the data are determined. These characteristics arethen used to provide the best match or matches in the data-base, the“best” determination being assisted by the partial symbolic information,if that is available.

Therefore the present invention provides technology and processes thatcan accommodate linking objects and images to information via a networksuch as the Internet, which requires no modification to the linkedobject. Traditional methods for linking objects to digital information,including applying a barcode, radio or optical transceiver ortransmitter, or some other means of identification to the object, ormodifying the data or object so as to encode detectable information init, are not required because the data or object can be identified solelyby its visual appearance. The users or devices may even interact withobjects by “linking” to them. For example, a user may link to a vendingmachine by “pointing and clicking” on it. His device would be connectedover the Internet to the company that owns the vending machine. Thecompany would in turn establish a connection to the vending machine, andthus the user would have a communication channel established with thevending machine and could interact with it.

The decomposition algorithms of the present invention allow fast andreliable detection and recognition of images and/or objects based ontheir visual appearance in an image, no matter whether shadows,reflections, partial obscuration, and variations in viewing geometry arepresent. As stated above, the present invention also can detect, decode,and identify images and objects based on traditional symbols which mayappear on the object, such as alphanumeric characters, barcodes, or2-dimensional matrix codes.

When a particular object is identified, the position and orientation ofan object with respect to the user at the time the data was captured canbe determined based on the appearance of the object in an image. Thiscan be the location and/or identity of people scanned by multiplecameras in a security system, a passive locator system more accuratethan GPS or usable in areas where GPS signals cannot be received, thelocation of specific vehicles without requiring a transmission from thevehicle, and many other uses.

When the present invention is incorporated into a mobile device, such asa portable telephone, the user of the device can link to images andobjects in his or her environment by pointing the device at the objectof interest, then “pointing and clicking” to capture an image.Thereafter, the device transmits the data to another computer(“Server”), wherein the data is analyzed and the object or data ofinterest is detected and recognized. Then the network address ofinformation corresponding to that object is transmitted from the(“Server”) back to the mobile device, allowing the mobile device toaccess information using the network address so that only a portion ofthe information concerning the object needs to be stored in the systemsdatabase.

Some or all of the data processing, including image/object detectionand/or decoding of symbols detected in the data, may be distributedarbitrarily between the mobile (Client) device and the Server. In otherwords, some processing may be performed in the Client device and some inthe Server. Additionally the processing may be performed withoutspecification of which particular processing is performed in each.However all processing may be performed on one platform or the other, orthe platforms may be combined so that there is only one platform. Thedata processing can be implemented in a parallel computing manner, thusfacilitating scaling of the system with respect to database size andinput traffic loading.

Therefore, it is an object of the present invention to provide a systemand process for identifying digitally captured images without requiringmodification to the object.

Another object is to use digital capture devices in ways nevercontemplated by their manufacturer.

Another object is to allow identification of objects from partial viewsof the object.

Another object is to provide communication means with operative deviceswithout requiring a public connection therewith.

Another object is to allow the telephony device to transmit informationand data derived from the captured data to the server.

Still another object of the invention is to provide a telephony devicethat may transmit motion imagery to the server.

Another object is to provide a communication means wherein the telephonydevice may transmit information/data derived from the data to theserver, as opposed to transmitting the data itself.

Yet another object of the present invention is to allow the telephonydevice to transmit either motion imagery and/or still images to theserver.

Another object of the present invention is to allow the server to sendan item of information to another distal device.

Yet another object of the present invention is to allow the system toperform data processing, data contrast enhancement, noise removal andde-blurring thereof.

Yet another object of the present invention is to allow the system toperform data processing prior to the recognition and/or search process.

Still another object of the present invention is to allow the system toperform data processing even if the data recognition and/or searchprocess fails.

Another object of the present invention is to allow the system toperform data processing after a prior data recognition and/or searchprocess fails.

These and other objects and advantages of the present invention willbecome apparent to those skilled in the art after considering thefollowing detailed specification, together with the accompanyingdrawings wherein:

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic block diagram top-level algorithm flowchart;

FIG. 2 is an idealized view of data capture;

FIGS. 3A and 3B are a schematic block diagram of process details of thepresent invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The present invention includes a novel process whereby information suchas Internet content is presented to a user, based solely on a remotelyacquired data of a physical object. Although coded information can beincluded in the remotely acquired image, it is not required since noadditional information about a physical object, other than its image,needs to be encoded in the linked object. There is no need for anyadditional code or device, radio, optical or otherwise, to be embeddedin or affixed to the object. Image-linked objects can be located andidentified within user-acquired imagery solely by means of digital dataprocessing, with the address of pertinent information being returned tothe device used to acquire the data and perform the link. This processis robust against digital data noise and corruption (as can result fromlossy data compression/decompression), perspective error, rotation,translation, scale differences, illumination variations caused bydifferent lighting sources, and partial obscuration of the target thatresults from shadowing, reflection or blockage.

Many different variations on machine vision “target location andidentification” exist in the current art. However, they all tend toprovide optimal solutions for an arbitrarily restricted search space. Atthe heart of the present invention is a high-speed data matching enginethat returns unambiguous matches to target objects contained in a widevariety of potential input images. This unique approach to data matchingtakes advantage of the fact that at least some portion of the targetobject will be found in the user-acquired image. Additionally, anotherunique approach is to allow for data processing by either the capturingdevice or the server prior to identification and transmission. Theparallel data comparison processes embodied in the present searchtechnique are, when taken together, unique to the process. Further,additional refinement of the process, with the inclusion of more and/ordifferent decomposition-parameterization functions, utilized within theoverall structure of the search loops is not restricted. The detailedprocess is described in the following FIG. 1 showing the overallprocessing flow and steps. These steps are described in further detailin the following sections.

For data capture 10, the User 12 (FIG. 2) utilizes a computer, mobiletelephone, personal digital assistant, or other similar device 14equipped with a data sensor (such as a CCD or CMOS digital camera). TheUser 12 aligns the sensor of the data capture device 14 with the object16 of interest. The linking process is then initiated by suitable meansincluding: the User 12 pressing a button on the device 14 or sensor; bythe software in the device 14 automatically recognizing that a data isto be acquired; by User voice command; or by any other appropriatemeans. The device 14 captures a digital data 18 of the scene at which itis pointed. This data 18 is represented as three separate 2-D matricesof pixels, corresponding to the raw RGB (Red, Green, Blue)representation of the input image. For the purposes of standardizing theanalytical processes in this embodiment, if the device 14 supplies adata in other than RGB format, a transformation to RGB is accomplished.These analyses could be carried out in any standard color format, shouldthe need arise.

If the Data/Server 20 is physically separate from the device 14, thenuser acquired images are transmitted from the device 14 to theData/Server 20 using a conventional digital network or wireless networkmeans. However, prior to transmitting the data to the data/server 20,the device 14 used to capture the data may first conduct dataprocessing, such as contrast enhancement, noise removal, de-blurring andthe like. This procedure of data processing may be done prior totransmission of the data to the data/server 20, or after search resultshave been returned to the device 14.

If the data 18 has been compressed (e.g. via lossy JPEG DCT) in a mannerthat introduces compression artifacts into the reconstructed data 18,these artifacts may be partially removed by, for example, applying aconventional despeckle filter to the reconstructed data prior toadditional processing. Additionally, the device 14 may transmit motionimagery, such as, for example, video transmissions. The motion imagerymay be transferred to the server instead of, or in conjunction with oneor more still images.

The Data Type Determination 26 is accomplished with a discriminatoralgorithm which operates on the input data 18 and determines whether theinput data contains recognizable symbols, such as barcodes, matrixcodes, or alphanumeric characters. If such symbols are found, the data18 is sent to the Decode Symbol 28 process. Depending on the confidencelevel with which the discriminator algorithm finds the symbols, the data18 also may or alternatively contain an object of interest and maytherefore also or alternatively be sent to the Object Data branch of theprocess flow. For example, if an input data 18 contains both a barcodeand an object, depending on the clarity with which the barcode isdetected, the data may be analyzed by both the Object Data and SymbolicData branches, and that branch which has the highest success inidentification will be used to identify and link from the object.

The data may be analyzed to determine the location, size, and nature ofthe symbols in the Decode Symbol 28. The symbols are analyzed accordingto their type, and their content information is extracted. For example,barcodes and alphanumeric characters will result in numerical and/ortext information.

For object images, the present invention performs a “decomposition”, inthe Input Data Decomposition 34, of a high-resolution input data intoseveral different types of quantifiable salient parameters. This allowsfor multiple independent convergent search processes of the database tooccur in parallel, which greatly improves data match speed and matchrobustness in the Database Matching 36. As illustrated above, a portionof the decomposition may be divided arbitrarily between the device 14and the server 20. The Best Match 38 from either the Decode Symbol 28,or the data Database Matching 36, or both, is then determined. If aspecific URL (or other online address) is associated with the image,then an URL Lookup 40 is performed and the Internet address is returnedby the URL Return 42. Additionally, during processing, the server maysend an item of information to another distal device (not shown). Forexample, if an data of a TV listing in a magazine is transmitted to theserver 20, the server may recognize the data as a TV listing wherein theserver 20 may send a command to a Internet-connected television tochange to the channel in the listing.

The overall flow of the Input Data Decomposition process is as follows:

Radiometric Correction

Segmentation

Segment Group Generation

FOR each segment group

Bounding Box Generation

Geometric Normalization

Wavelet Decomposition

Color Cube Decomposition

Shape Decomposition

Low-Resolution Grayscale Image Generation

FOR END

Each of the above steps is explained in further detail below. ForRadiometric Correction, the input image typically is transformed to an8-bit per color plane, RGB representation. The RGB image isradiometrically normalized in all three channels. This normalization isaccomplished by linear gain and offset transformations that result inthe pixel values within each color channel spanning a full 8-bit dynamicrange (256 possible discrete values). An 8-bit dynamic range is adequatebut, of course, as optical capture devices produce higher resolutionimages and computers get faster and memory gets cheaper, higher bitdynamic ranges, such as 16-bit, 32-bit or more may be used.

For Segmentation, the radiometrically normalized RGB image is analyzedfor “segments,” or regions of similar color, i.e. near equal pixelvalues for red, green, and blue. These segments are defined by theirboundaries, which consist of sets of (x, y) point pairs. A map ofsegment boundaries is produced, which is maintained separately from theRGB input image and is formatted as an x, y binary image map of the sameaspect ratio as the RGB image.

For Segment Group Generation, the segments are grouped into all possiblecombinations. These groups are known as “segment groups” and representall possible potential images or objects of interest in the input image.The segment groups are sorted based on the order in which they will beevaluated. Various evaluation order schemes are possible. The particularembodiment explained herein utilizes the following “center-out” scheme:The first segment group comprises only the segment that includes thecenter of the image. The next segment group comprises the previoussegment plus the segment which is the largest (in number of pixels) andwhich is adjacent to (touching) the previous segment group. Additionalsegments are added using the segment criteria above until no segmentsremain. Each step, in which a new segment is added, creates a new andunique segment group.

For Bounding Box Generation, the elliptical major axis of the segmentgroup under consideration (the major axis of an ellipse just largeenough to contain the entire segment group) is computed. Then arectangle is constructed within the image coordinate system, with longsides parallel to the elliptical major axis, of a size just large enoughto completely contain every pixel in the segment group.

For Geometric Normalization, a copy of the input image is modified suchthat all pixels not included in the segment group under considerationare set to mid-level gray. The result is then resampled and mapped intoa “standard aspect” output test image space such that the corners of thebounding box are mapped into the corners of the output test image. Thestandard aspect is the same size and aspect ratio as the Referenceimages used to create the database.

For Wavelet Decomposition, a grayscale representation of the full-colorimage is produced from the geometrically normalized image that resultedfrom the Geometric Normalization step. The following procedure is usedto derive the grayscale representation. Reduce the three color planesinto one grayscale image by proportionately adding each R, G, and Bpixel of the standard corrected color image using the following formula:L.sub.x,y=0.34*R.sub.x,y+0.55*G.sub.x,y+0.11*B.sub.x,y

then round to nearest integer value. Truncate at 0 and 255, ifnecessary. The resulting matrix L is a standard grayscale image. Thisgrayscale representation is at the same spatial resolution as the fullcolor image, with an 8-bit dynamic range. A multi-resolution WaveletDecomposition of the grayscale image is performed, yielding waveletcoefficients for several scale factors. The Wavelet coefficients atvarious scales are ranked according to their weight within the image.

For Color Cube Decomposition, an image segmentation is performed (see“Segmentation” above), on the RGB image that results from GeometricNormalization. Then the RGB image is transformed to a normalizedIntensity, In-phase and Quadrature-phase color image (YIQ). The segmentmap is used to identify the principal color regions of the image, sinceeach segment boundary encloses pixels of similar color. The average Y,I, and Q values of each segment, and their individual component standarddeviations, are computed. The following set of parameters result,representing the colors, color variation, and size for each segment:

Y.sub.avg=Average Intensity

I.sub.avg=Average In-phase

Q.sub.avg=Average Quadrature

Y.sub.sigma=Intensity standard deviation

I.sub.sigma=In-phase standard deviation

Q.sub.sigma=Quadrature standard deviation

N.sub.pixels=number of pixels in the segment

The parameters comprise a representation of the color intensity andvariation in each segment. When taken together for all segments in asegment group, these parameters comprise points (or more accurately,regions, if the standard deviations are taken into account) in athree-dimensional color space and describe the intensity and variationof color in the segment group.

For Shape Decomposition, the map resulting from the segmentationperformed in the Color Cube Generation step is used and the segmentgroup is evaluated to extract the group outer edge boundary, the totalarea enclosed by the boundary, and its area centroid. Additionally, thenet ellipticity (semi-major axis divided by semi-minor axis of theclosest fit ellipse to the group) is determined.

For Low-Resolution Grayscale Image Generation, the full-resolutiongrayscale representation of the image that was derived in the WaveletGeneration step is now subsampled by a factor in both x and ydirections. For the example of this embodiment, a 3:1 subsampling isassumed. The subsampled image is produced by weighted averaging ofpixels within each 3.times.3 cell. The result is contrast binned, byreducing the number of discrete values assignable to each pixel basedupon substituting a “binned average” value for all pixels that fallwithin a discrete (TBD) number of brightness bins.

The above discussion of the particular decomposition methodsincorporated into this embodiment are not intended to indicate thatmore, or alternate, decomposition methods may not also be employedwithin the context of this invention.

In other words:

-   FOR each input image segment group FOR each database object FOR each    view of this object FOR each segment group in this view of this    database object Shape Comparison Grayscale Comparison Wavelet    Comparison Color Cube Comparison Calculate Combined Match Score END    FOR END FOR END FOR END FOR

Each of the above steps is explained in further detail below.

FOR Each Input Image Segment Group

This loop considers each combination of segment groups in the inputimage, in the order in which they were sorted in the “Segment GroupGeneration” step. Each segment group, as it is considered, is acandidate for the object of interest in the image, and it is comparedagainst database objects using various tests.

One favored implementation, of many possible, for the order in which thesegment groups are considered within this loop is the “center-out”approach mentioned previously in the “Segment Group Generation” section.This scheme considers segment groups in a sequence that represents theaddition of adjacent segments to the group, starting at the center ofthe image. In this scheme, each new group that is considered comprisesthe previous group plus one additional adjacent image segment. The newgroup is compared against the database. If the new group results in ahigher database matching score than the previous group, then new groupis retained. If the new group has a lower matching score then theprevious group, then it is discarded and the loop starts again. If aparticular segment group results in a match score which is extremelyhigh, then this is considered to be an exact match and no furthersearching is warranted; in this case the current group and matchingdatabase group are selected as the match and this loop is exited.

FOR Each Database Object

This loop considers each object in the database for comparison againstthe current input segment group.

FOR Each View of this Object

This loop considers each view of the current database object forcomparison against the current input segment group. The databasecontains, for each object, multiple views from different viewing angles.

FOR Each Segment Group in this View of this Database Object

This loop considers each combination of segment groups in the currentview of the database object. These segment groups were created in thesame manner as the input image segment groups.

Shape Comparison

Inputs

For the input image and all database images:

I. Segment group outline

I. Segment group area

III. Segment group centroid location

IV. Segment group bounding ellipse ellipticity

Algorithm

V. Identify those database segment groups with an area approximatelyequal to that of the input segment group, within TBD limits, andcalculate an area matching score for each of these “matches.”

VI. Within the set of matches identified in the previous step, identifythose database segment groups with an ellipticity approximately equal tothat of the input segment group, within TBD limits, and calculate anellipticity position matching score for each of these “matches.”

VII. Within the set of matches identified in the previous step, identifythose database segment groups with a centroid position approximatelyequal to that of the input segment group, within TBD limits, andcalculate a centroid position matching score for each of these“matches.”

VIII. Within the set of matches identified in the previous step,identify those database segment groups with an outline shapeapproximately equal to that of the input segment group, within TBDlimits, and calculate an outline matching score for each of these“matches.” This is done by comparing the two outlines and analyticallydetermining the extent to which they match.

Note: this algorithm need not necessarily be performed in the order ofSteps 1 to 4. It could alternatively proceed as follows:

-   2 FOR each database segment group IF the group passes Step 1 IF the    group passes Step 2 IF the group passes Step 3 IF the group passes    Step 4 Successful comparison, save result END IF END IF END IF END    IF END FOR

Grayscale Comparison

Inputs

For the input image and all database images:

IX. Low-resolution, normalized, contrast-binned, grayscale image ofpixels within segment group bounding box, with pixels outside of thesegment group set to a standard background color.

Algorithm

Given a series of concentric rectangular “tiers” of pixels within thelow-resolution images, compare the input image pixel values to those ofall database images, calculate a matching score for each comparison andidentify those database images with matching scores within TBD limits,as follows:

FOR each database image

FOR each tier, starting with the innermost and progressing to theoutermost

Compare the pixel values between the input and database image

Calculate an aggregate matching score IF matching score is greater thansome TBD limit (i.e., close match)

-   3 Successful comparison, save result END IF END FOR END FOR

Wavelet Comparison

Inputs

For the input image and all database images:

X. Wavelet coefficients from high-resolution grayscale image withinsegment group bounding box.

Algorithm

Successively compare the wavelet coefficients of the input segment groupimage and each database segment group image, starting with thelowest-order coefficients and progressing to the highest ordercoefficients. For each comparison, compute a matching score. For eachnew coefficient, only consider those database groups that had matchingscores, at the previous (next lower order) coefficient within TBDlimits.

4 FOR each database image IF input image C.sub.0 equals database imageC.sub.0 within TBD limit IF input image C.sub.1 equals database imageC.sub.1 within TBD limit . . . IF input image C.sub.N equals databaseimage C.sub.N within TBD limit Close match, save result and match scoreEND IF . . . END IF END IF END FOR Notes: I. “C.sub.1” are the waveletcoefficients, with C.sub.0 being the lowest order coefficient andC.sub.N being the highest. II. When the coefficients are compared, theyare actually compared on a statistical (e.g. Gaussian) basis, ratherthan an arithmetic difference. III. Data indexing techniques are used toallow direct fast access to database images according to their C.sub.ivalues. This allows the algorithm to successively narrow the portions ofthe database of interest as it proceeds from the lowest order terms tothe highest.

Color Cube Comparison

Inputs

[Y.sub.avg, I.sub.avg, Q.sub.avg, Ysigma, I.sub.sigma, Q.sub.sigma,Npixels] data sets (“Color Cube Points”) for each segment in:

I. The input segment group image

II. Each database segment group image

Algorithm

-   5 FOR each database image FOR each segment group in the database    image FOR each Color Cube Point in database segment group, in order    of descending Npixels value IF Gaussian match between input (Y,I,Q)    and database (Y,I,Q) I. Calculate match score for this segment II.    Accumulate segment match score into aggregate match score for    segment group III. IF aggregate matching score is greater than some    TBD limit (i.e., close match) Successful comparison, save result END    IF END FOR END FOR END FOR Notes: I. The size of the Gaussian    envelope about any Y, I, Q point is determined by RSS of standard    deviations of Y, I, and Q for that point.

Calculate Combined Match Score

The four Object Image comparisons (Shape Comparison, GrayscaleComparison, Wavelet Comparison, Color Cube Comparison) each return anormalized matching score. These are independent assessments of thematch of salient features of the input image to database images. Tominimize the effect of uncertainties in any single comparison process,and to thus minimize the likelihood of returning a false match, thefollowing root sum of squares relationship is used to combine theresults of the individual comparisons into a combined match score for animage:

-   CurrentMatch=SQRT(W.sub.OCM.sub.OC.sup.2+W.sub.CCCM.sub.CCC.sup.2+W.sub.W-CM.sub.WC.sup.2+W.sub.SGCM.sub.SGC.sup.2),    where Ws are TBD parameter weighting coefficients and Ms are the    individual match scores of the four different comparisons.

The unique database search methodology and subsequent object matchscoring criteria are novel aspects of the present invention that deservespecial attention. Each decomposition of the Reference image and Inputimage regions represent an independent characterization of salientcharacteristics of the image. The Wavelet Decomposition, Color CubeDecomposition, Shape Decomposition, and evaluation of a sub-sampledlow-resolution Grayscale representation of an input image all producesets of parameters that describe the image in independent ways. Once allfour of these processes are completed on the image to be tested, theparameters provided by each characterization are compared to the resultsof identical characterizations of the Reference images, which have beenpreviously calculated and stored in the database. These comparisons, orsearches, are carried out in parallel. The result of each search is anumerical score that is a weighted measure of the number of salientcharacteristics that “match” (i.e. that are statistically equivalent).Near equivalencies are also noted, and are counted in the cumulativescore, but at a significantly reduced weighting.

One novel aspect of the database search methodology in the presentinvention is that not only are these independent searches carried out inparallel, but also, all but the low-resolution grayscale compares are“convergent.” By convergent, it is meant that input image parameters aresearched sequentially over increasingly smaller subsets of the entiredatabase. The parameter carrying greatest weight from the input image iscompared first to find statistical matches and near-matches in alldatabase records. A normalized interim score (e.g., scaled value fromzero to one, where one is perfect match and zero is no match) iscomputed based on the results of this comparison. The next heaviestweighted parameter from the input image characterization is thensearched on only those database records having initial interim scoresabove a minimum acceptable threshold value. This results in anincremental score that is incorporated into the interim score in acumulative fashion. Then, subsequent comparisons of increasinglylesser-weighted parameters are assessed only on those database recordsthat have cumulative interim scores above the same minimum acceptablethreshold value in the previous accumulated set of tests.

This search technique results in quick completion of robust matches,establishes limits on the domain of database elements that will becompared in a subsequent combined match calculation and therefore speedsup the process. The convergent nature of the search in these comparisonsyields a ranked subset of the entire database.

The result of each of these database comparisons is a ranking of thematch quality of each image, as a function of decomposition searchtechnique. Only those images with final cumulative scores above theacceptable match threshold will be assessed in the next step, a CombinedMatch Score evaluation.

Four database comparison processes, Shape Comparison, GrayscaleComparison, Wavelet Comparison, and Color Cube Comparison, areperformed. These processes may occur sequentially, but generally arepreferably performed in parallel on a parallel computing platform. Eachcomparison technique searches the entire image database and returnsthose images that provide the best matches for the particular algorithm,along with the matching scores for these images. These comparisonalgorithms are performed on segment groups, with each input imagesegment group being compared to each segment group for each databaseimage.

FIGS. 3A and 3B show the process flow within the Database Matchingoperation. The algorithm is presented here as containing four nestedloops with four parallel processes inside the innermost loop. Thisstructure is for presentation and explanation only. The actualimplementation, although performing the same operations at the innermostlayer, can have a different structure in order to achieve the maximumbenefit from processing speed enhancement techniques such as parallelcomputing and data indexing techniques. It is also important to notethat the loop structures can be implemented independently for each innercomparison, rather than the shared approach shown in the FIGS. 3A and3B.

Preferably, parallel processing is used to divide tasks between multipleCPUs (Central Processing Units), the telephony device 14 and/orcomputers. The overall algorithm may be divided in several ways, suchas:

-   6 Sharing the In this technique, all CPUs run the entire Outer Loop:    algorithm, including the outer loop, but one CPU runs the loop for    the first N cycles, another CPU for the second N cycles, all    simultaneously. Sharing the In this technique, one CPU performs the    Comparisons: loop functions. When the comparisons are performed,    they are each passed to a separate CPU to be performed in parallel.    Sharing the This technique entails splitting database Database:    searches between CPUs, so that each CPU is responsible for searching    one section of the database, and the sections are searched in    parallel by multiple CPUs. This is, in essence, a form of the    “Sharing the Outer Loop” technique described above.

Actual implementations can be some combination of the above techniquesthat optimizes the process on the available hardware.

Another technique employed to maximize speed is data indexing. Thistechnique involves using a prior knowledge of where data resides to onlysearch in those parts of the database that contain potential matches.Various forms of indexing may be used, such as hash tables, datacompartmentalization (i.e., data within certain value ranges are storedin certain locations), data sorting, and database table indexing. Anexample of such techniques is in the

Shape Comparison algorithm (see below). If a database is to be searchedfor an entry with an Area with a value of A, the algorithm would knowwhich database entries or data areas have this approximate value andwould not need to search the entire database.

Thus, there has been shown novel identification methods and processesfor objects from digitally captured images thereof that uses imagecharacteristics to identify an object from a plurality of objects in adatabase apparatus and which fulfill all of the objects and advantagessought therefor. Many changes, alterations, modifications and other usesand applications of the subject invention will become apparent to thoseskilled in the art after considering the specification together with theaccompanying drawings. All such changes, alterations and modificationswhich do not depart from the spirit and scope of the invention aredeemed to be covered by the invention which is limited only by theclaims that follow.

What is claimed is:
 1. A communication system, comprising: at least onedata processing platform device configured to: receive, from a mobiledevice, digital data representing a machine; recognize the machinerepresented in the digital data as a target object; retrieve an addressfor the machine from a search of a database storing informationconcerning a plurality of target objects including the target object;and enable the mobile device, via the address, to establish acommunication link with the machine.
 2. The system of claim 1, whereinthe communication link comprises a connection to a company associatedwith the machine.
 3. The system of claim 2, wherein the communicationlink further comprises a connection from the company to the machine. 4.The system of claim 2, wherein the address is associated with thecompany.
 5. The system of claim 1, wherein the address comprises atleast one of the following: a network address, an information address,and a URL.
 6. The system of claim 1, wherein the communication linkcomprises an Internet connection.
 7. The system of claim 1, wherein thecommunication link comprises a cellular connection.
 8. The system ofclaim 1, wherein the communication link comprises a wireless connection.9. The system of claim 8, wherein the wireless connection comprises atleast one of the following wireless connections: a Bluetooth connection,an 802.11 connection, a radio frequency connection, a modulated lightconnection, and an infrared connection.
 10. The system of claim 1,wherein the machine comprises a vending machine.
 11. The system of claim1, wherein the machine comprises a television.
 12. The system of claim1, wherein the machine comprises a gas pump.
 13. The system of claim 1,wherein the machine comprises an automated teller machine.
 14. Thesystem of claim 1, wherein the machine comprises a vehicle.
 15. Thesystem of claim 1, wherein the machine includes a tag.
 16. The system ofclaim 1, wherein the machine lacks a tag.
 17. The system of claim 1,further comprising the database configured to store informationconcerning the plurality of target objects.
 18. The system of claim 1,wherein the at least one data processing platform device comprises aparallel processing platform.
 19. The system of claim 1, wherein thedigital data comprises image data.
 20. The system of claim 19, whereinthe image data comprise video data.
 21. The system of claim 1, whereinthe at least one data processing platform device comprises the mobiledevice.
 22. The system of claim 21, wherein the mobile device comprisesa cellular phone.
 23. The system of claim 1, wherein the at least onedata processing platform device comprises a computer server.
 24. Amethod of establishing a communication link comprising: receiving by adata processing platform device and from a mobile device, digital datarepresenting a machine; recognizing, by the data processing platformdevice, the machine represented in the digital data as a target object;retrieving, by the data processing platform device, an address for themachine from a search of a database storing information concerning aplurality of target objects including the target object; and enablingthe mobile device, via the address, to establish the communication linkwith the machine.
 25. The method of claim 24, wherein the communicationlink comprises a connection to a company associated with the machine.26. The method of claim 25, wherein the communication link furthercomprises a connection from the company to the machine.
 27. The methodof claim 25, wherein the address is associated with the company.
 28. Themethod of claim 24, wherein the address comprises at least one of thefollowing: a network address, an information address, and a URL.
 29. Themethod of claim 24, wherein the communication link comprises an Internetconnection.
 30. The method of claim 24, wherein the communication linkcomprises a cellular connection.
 31. The system of claim 24, wherein thecommunication link comprises a wireless connection.
 32. The method ofclaim 31, wherein the wireless connection comprises at least one of thefollowing wireless connections: a Bluetooth connection, an 802.11connection, a radio frequency connection, a modulated light connection,and an infrared connection.
 33. The method of claim 24, wherein themachine comprises a vending machine.
 34. The method of claim 24, whereinthe machine comprises a television.
 35. The method of claim 24, whereinthe machine comprises a gas pump.
 36. The method of claim 24, whereinthe machine comprises an automated teller machine.
 37. The method ofclaim 24, wherein the machine comprises a vehicle.
 38. The method ofclaim 24, wherein the machine includes a tag.
 39. The method of claim24, wherein the machine lacks a tag.
 40. The method of claim 24, furthercomprising recognizing the machine via a parallel processing platform.41. The system of claim 24, wherein the digital data comprises imagedata.
 42. The system of claim 41, wherein the image data comprise videodata.
 43. The system of claim 24, wherein the data processing platformdevice comprises the mobile device.
 44. The system of claim 43, whereinthe mobile device comprises a cellular phone.
 45. The system of claim24, wherein the data processing platform device comprises a computerserver.